Approximating the maximum consecutive subsums of a sequence
نویسندگان
چکیده
منابع مشابه
Approximating the maximum consecutive subsums of a sequence
Dedicated to Professor Gad M. Landau, on the occasion of his 60th birthday
متن کاملSearching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution
Given a sequence of n numbers, theMaximum Consecutive Subsums Problem(MCSP) asks for the maximum consecutive sum of lengths l for each l = 1, . . . , n. No algorithm is known for this problem which is significantly better than the naive quadratic solution. Nor a super linear lower bound is known. The best known bound for the MCSP is based on the the computation of the (min,+)-convolution, anoth...
متن کاملApproximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first node layer of the graph, with the constraint that all paths have both endpoints in the second node layer and no node in that layer is covered more than once. MS is equivalent to the node-duplication based crossing elimination proble...
متن کاملApproximating maximum clique with a Hopfield network
In a graph, a clique is a set of vertices such that every pair is connected by an edge. MAX-CLIQUE is the optimization problem of finding the largest clique in a given graph and is NP-hard, even to approximate well. Several real-world and theory problems can be modeled as MAX-CLIQUE. In this paper, we efficiently approximate MAX-CLIQUE in a special case of the Hopfield network whose stable stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.05.032